A successive constraint approach to solving parameter-dependent linear matrix inequalities
نویسندگان
چکیده
منابع مشابه
Linear Matrix Inequalities Approach to Input Covariance Constraint Control With Application to Electronic Throttle
In this paper, the input covariance constraint (ICC) control problem is solved by convex optimization subject to linear matrix inequalities (LMIs) constraints. The ICC control problem is an optimal control problem that is concerned to obtain the best output performance subject to multiple constraints on the input covariance matrices. The contribution of this paper is the characterization of the...
متن کاملA Finite Step Projective Algorithm for Solving Linear Matrix Inequalities
This paper presents an algorithm for finding feasible solutions of linear matrix inequalities. The algorithm is based on the method of alternating projections (MAP), a classical method for solving convex feasibility problems. Unlike MAP, which is an iterative method that converges asymptotically to a feasible point, the algorithm converges after a finite number of steps. The key computational c...
متن کاملA new approach for solving the first-order linear matrix differential equations
Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...
متن کاملFeasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
We present a constraint analysis methodology for Linear Matrix Inequality (LMI) constraints. If the constraint set is found to be feasible we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sa...
متن کاملRandomized algorithms to solve parameter-dependent linear matrix
The randomized algorithm of Polyak and Tempo (2000), which consists of random sampling and subgradient descent, is generalized in order to solve parameter-dependent linear matrix inequalities and its computational complexity is analyzed. This paper first examines an algorithm obtained by direct generalization of Polyak and Tempo’s and shows that its expected time to achieve a solution is infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2017
ISSN: 1631-073X
DOI: 10.1016/j.crma.2017.05.001